A Neural Network Monte Carlo Approximation for Expected Utility Theory
نویسندگان
چکیده
This paper proposes an approximation method to create optimal continuous-time portfolio strategy based on a combination of neural networks and Monte Carlo, named NNMC. work is motivated by the increasing complexity models stylized facts reported in literature. We within expected utility theory for selection with constant relative risk aversion utility. The extends recursive polynomial exponential framework adopting fit value function. developed two network architectures explored several activation functions. methodology was applied four settings: 4/2 stochastic volatility (SV) model types market price risk, jumps, Ornstein–Uhlenbeck model. In only one case, closed-form solution available, which helps comparisons. report accuracy various settings terms strategy, performance computational efficiency, highlighting potential NNMC tackle complex dynamic models.
منابع مشابه
Monte Carlo Algorithms for Expected Utility Estimation in Dynamic Purchasing
This thesis describes a theory for decision-making in a dynamic purchasing environment where one of possibly many bundles of items must be purchased from possibly many suppliers. The online combinatorial purchasing problem is defined as the problem with which a purchase agent in such an environment is faced when deciding which combination of items, from whom and at what time to buy in order to ...
متن کاملNeural Network Gradient Hamiltonian Monte Carlo
Hamiltonian Monte Carlo is a widely used algorithm for sampling from posterior distributions of complex Bayesian models. It can efficiently explore high-dimensional parameter spaces guided by simulated Hamiltonian flows. However, the algorithm requires repeated gradient calculations, and these computations become increasingly burdensome as data sets scale. We present a method to substantially r...
متن کاملA Monte Carlo AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. Our approach is based on a direct approximation of AIXI, a Bayesian optimality notion for general reinforcement learning agents. Previously, it has been unclear whether the theory of AIXI could motivate the design of practical algorithms. We answer this hitherto open question in the af...
متن کاملA Monte Carlo AIXI Approximation
We implemented the algorithm for learning and planning in partially observable Markov decision processes described in A Monte Carlo AIXI Approximation. Because this paper is highly focused on the theoretical aspect of the AIXI approximation, some details were omitted for ease of presentation. We used the following test domains from the paper to assess the performance of our replication, • 1d-Ma...
متن کاملA Stochastic Expected Utility Theory
This paper proposes a new model that explains the violations of expected utility theory through the role of random errors. The paper analyzes decision making under risk when individuals make random errors when they compute expected utilities. Errors are drawn from the normal distribution, which is truncated so that the stochastic utility of a lottery cannot be greater (lower) than the utility o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of risk and financial management
سال: 2021
ISSN: ['1911-8074', '1911-8066']
DOI: https://doi.org/10.3390/jrfm14070322